Data Structures for Accelerating Tanimoto Queries on Real Valued Vectors
نویسندگان
چکیده
Previous methods for accelerating Tanimoto queries have been based on using bit strings for representing molecules. No work has gone into examining accelerating Tanimoto queries on real valued descriptors, even though these offer a much more fine grained measure of similarity between molecules. This study utilises a recently discovered reduction from Tanimoto queries to distance queries in Euclidean space to accelerate Tanimoto queries using standard metric data structures. The presented experiments show that it is possible to gain a significant speedup and that general metric data structures are better suited than a data structure tailored for Euclidean space on vectors generated from molecular data.
منابع مشابه
Improvement of the Analytical Queries Response Time in Real-Time Data Warehouse using Materialized Views Concatenation
A real-time data warehouse is a collection of recent and hierarchical data that is used for managers’ decision-making by creating online analytical queries. The volume of data collected from data sources and entered into the real-time data warehouse is constantly increasing. Moreover, as the volume of input data to the real time data warehouse increases, the interference between online loading ...
متن کاملThe ring of real-valued functions on a frame
In this paper, we define and study the notion of the real-valued functions on a frame $L$. We show that $F(L) $, consisting of all frame homomorphisms from the power set of $mathbb{R}$ to a frame $ L$, is an $f$-ring, as a generalization of all functions from a set $X$ into $mathbb R$. Also, we show that $F(L) $ is isomorphic to a sub-$f$-ring of $mathcal{R}(L)$, the ring of real-valued continu...
متن کاملIndex Structures for Databases Containing Data Items with Set-valued Attributes Index Structures for Databases Containing Data Items with Set-valued Attributes
We introduce two new hash-based index structures to index set-valued attributes. Both are able to support subset and superset queries. Analytical cost models for the new index structures as well as for the two existing index structures, sequential signature le and Russian Doll Tree, are presented and experimentally validated. Using the validated cost model, we express the performance of all fou...
متن کاملPointfree topology version of image of real-valued continuous functions
Let $ { mathcal{R}} L$ be the ring of real-valued continuous functions on a frame $L$ as the pointfree version of $C(X)$, the ring of all real-valued continuous functions on a topological space $X$. Since $C_c(X)$ is the largest subring of $C(X)$ whose elements have countable image, this motivates us to present the pointfree version of $C_c(X).$The main aim of this paper is to present t...
متن کاملCountable composition closedness and integer-valued continuous functions in pointfree topology
For any archimedean$f$-ring $A$ with unit in whichbreak$awedge (1-a)leq 0$ for all $ain A$, the following are shown to be equivalent: 1. $A$ is isomorphic to the $l$-ring ${mathfrak Z}L$ of all integer-valued continuous functions on some frame $L$. 2. $A$ is a homomorphic image of the $l$-ring $C_{Bbb Z}(X)$ of all integer-valued continuous functions, in the usual se...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010